Erik Demaine - PDFSEARCH.IO - Document Search Engine

Erik Demaine
Results: 203

#	Item
161	6.851: Advanced Data Structures Spring 2012 Lecture 7 — 8 March, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:43 Mathematics Cache Analysis of algorithms B-tree Computational complexity theory Cache-oblivious algorithm Binary search tree Heap CPU cache Theoretical computer science Binary trees Computing
162	6.851: Advanced Data Structures Spring 2012 Lecture 14 — April 10, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-22 12:47:48 Theoretical computer science Integer sorting Radix sort Bitonic sorter Merge sort Priority queue Binary logarithm Time complexity Trie Sorting algorithms Mathematics Order theory
163	6.851: Advanced Data Structures Spring 2012 Lecture 9 — March 15, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 21:33:16 Sorting algorithms Bin Merge sort Range searching Computational geometry Cache-oblivious algorithm FO Database index Mathematics Computing Theoretical computer science
164	6.851: Advanced Data Structures Spring 2012 Lecture 6 — March 6, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:43 Combinatorics Tango tree Algorithm H tree Binary search tree Splay tree Self-balancing binary search tree B-tree Bin Binary trees Graph theory Mathematics
165	6.851: Advanced Data Structures Spring 2012 Lecture 3 — February 23, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:42 Computer programming Point location Fractional cascading Binary search tree B-tree AVL tree Self-balancing binary search tree Tree Rope Binary trees Graph theory Computing
166	ITR: Scalable Location-Aware Monitoring (SLAM) Systems Hari Balakrishnan, Erik Demaine, Mike Stonebraker, Seth Teller Laboratory for Computer Science & Department of EECS Massachusetts Institute of Technology Cambridge, Add to Reading List Source URL: nms.lcs.mit.edu Language: English - Date: 2003-01-16 12:03:27 Radio navigation Wireless sensor network Beacon Global Positioning System Technology Navigation Wireless networking
167	Spring[removed]: Advanced Data Structures Lecture 5 — March 1, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2014-02-25 15:05:08 Splay tree Treap Binary search tree Self-balancing binary search tree Heap Red–black tree B-tree AVL tree Tree traversal Binary trees Graph theory Computing
168	Ununfoldable Polyhedra with Convex Faces Marshall Bern∗ Eric Kuo§ Erik D. Demaine† Andrea Mantler¶ Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2001-08-27 16:10:29 Polyhedra Deltahedra Platonic solids Polytopes Nonconvex polyhedra Polyhedron Octahedron Icosahedron Vertex Geometry Convex geometry Euclidean geometry
169	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine and Srini Devadas September 15, 2011 Problem Set 2 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-09-25 21:36:41 Computer science Programming idioms Computational complexity theory Asymptotic analysis Recursion Theory of computation Rendering Big O notation Time complexity Theoretical computer science Analysis of algorithms Mathematics
170	6.851: Advanced Data Structures Spring 2012 Lecture 8 — 13 March, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-13 20:05:06 Abstract data types Data management B-tree Arrays Circular buffer Computer memory Linked list Priority queue Stack Computing Graph theory Binary trees